A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
نویسندگان
چکیده
منابع مشابه
A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
In this study, we determine the upper and lower bounds for the processing time of each job under controllable machining conditions. The proposed bounding scheme is used to find a set of discrete efficient points on the efficient frontier for a bi-criteria scheduling problem on a single CNC machine. We have two objectives; minimizing the manufacturing cost (comprised of machining and tooling cos...
متن کاملScheduling with Controllable Processing Times
In today's industrial world, demand nature is changing where the customers are looking for a high variety of products. In order to meet varying customer demands, the firms should be flexible enough to produce parts in an efficient way. The flexible manufacturing systems have emerged with the progress in manufacturing technology. A flexible manufacturing system (FMS) is a computer-controlled pro...
متن کاملSingle Machine Scheduling with Controllable Processing Times by submodular Optimization
In scheduling with controllable processing times the actual processing time of each job is to be chosen from the interval between the smallest (compressed or fully crashed) value and the largest (decompressed or uncrashed) value. In the problems under consideration, the jobs are processed on a single machine and the quality of a schedule is measured by two functions: the maximum cost (that depe...
متن کاملApproximation schemes for parallel machine scheduling problems with controllable processing times
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have a controllable processing time means that it is allowed to compress (a part of) the processing time of the job, in return for compression cost. We present the first known polynomial time approximation schemes for the ...
متن کاملJob Shop Scheduling Problems with Controllable Processing Times
In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing times means that it is possible to reduce the processing time of the jobs by paying a certain cost. We consider two models of controllable processing times: continuous and discrete. For both models we present polynomial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2005
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2004.07.012